#pragma GCC optimize(2)
#include <iostream>
#include <algorithm>
#include <cstring>
#include <string>
#include <map>
#include <unordered_map>
#include <vector>
#include <set>
#include <queue>

using namespace std;
using LL = long long;
using PII = pair<int, int>;
const int N = 2e5 + 10;

int n, k;
int q[N], res[N];

void solve(){
    cin >> n >> k;

    int cnt = 0;
    for(int i = 1; i <= n; i ++) {
        cin >> q[i];
        if(q[i] % 2) cnt ++;
    }

    int p = cnt / k;
    if(p == 0) {
        cout << "NO" << '\n';
        return;
    }

    if(p % 2 == 0) {
        p -= 1;
    }
    int t = cnt - p * k;

    if(t % 2 == 0){
        cout << "YES" << '\n';
        for(int i = 1; i <= k; i ++) res[i] = p;
        res[k] += t;
        // for(int i = 1; i <= k; i ++){
        //     cout << res[i] << " ";
        // }
        // cout << '\n';

        int nums = 0, f = 1;
        for(int i = 1; i <= n; i ++){
            if(q[i] % 2) nums ++;
            if(nums == res[f]){
                if(f != k){
                    f ++;
                    nums = 0;
                    cout << i << " ";
                }
            }
            
        }
        cout << n ;
        cout << '\n';
    }else{
        cout << "NO" << '\n';
        return;
    }

    
}

int main(){
#ifdef LOCALFLAG
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
#endif


    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int T;
    cin >> T;
    while(T--){
        solve();
    }

    return 0;
}